Solving algebraic equations in roots of unity

نویسنده

  • Iskander Aliev
چکیده

This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called maximal torsion cosets. We obtain new explicit upper bounds for the number of maximal torsion cosets on an algebraic subvariety of the complex algebraic n-torus Gm. In contrast to earlier works that give the bounds of polynomial growth in the maximum total degree of defining polynomials, the proofs of our results are constructive. This allows us to obtain a new algorithm for determining maximal torsion cosets on an algebraic subvariety of Gm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems

We show deterministic polynomial time algorithms over some family of finite fields for solving univariate polynomial equations and some related problems such as taking nth roots, constructing nth nonresidues, constructing primitive elements and computing elliptic curve “nth roots”. In additional, we present a deterministic polynomial time primality test for some family of integers. All algorith...

متن کامل

Nonlinear Difference Equations with Periodic Solutions

For ten nonlinear difference equations with only p-periodic solutions it is shown that the characteristic polynomials of the corresponding linearized equations about the equilibria have only zeros which are p-th roots of unity. An analogous result is shown concerning two systems of such equations. Five counterexamples show that the reverse is not true. Some remarks are made concerning equations...

متن کامل

A Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations

In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...

متن کامل

Auxiliary matrices for the six-vertex model and the algebraic Bethe ansatz

We connect two alternative concepts of solving integrable models, Baxter’s method of auxiliary matrices (or Q-operators) and the algebraic Bethe ansatz. The main steps of the calculation are performed in a general setting and a formula for the Bethe eigenvalues of the Q-operator is derived. A proof is given for states which contain up to three Bethe roots. Further evidence is provided by relati...

متن کامل

Bernoulli collocation method with residual correction for solving integral-algebraic equations

The principal aim of this paper is to serve the numerical solution of an integral-algebraic equation (IAE) by using the Bernoulli polynomials and the residual correction method. After implementation of our scheme, the main problem would be transformed into a system of algebraic equations such that its solutions are the unknown Bernoulli coefficients. This method gives an analytic solution when ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008